Load balancing of dynamical distribution networks with flow constraints and unknown in/outflows

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis and Comparison of Load Flow Methods for Distribution Networks Considering Distributed Generation

Conventional passive distribution networks are changing to modern active distribution networks which are not radial. Conventional load flow methods should be modified for new distribution networks analysis. In modern distribution networks distributed generation (DG) units are embedded with conventional and/or renewable resources. DG units are generally modeled as PV or PQ nodes which inject ...

متن کامل

analysis and comparison of load flow methods for distribution networks considering distributed generation

conventional passive distribution networks are changing to modern active distribution networks which are not radial. conventional load flow methods should be modified for new distribution networks analysis. in modern distribution networks distributed generation (dg) units are embedded with conventional and/or renewable resources. dg units are generally modeled as pv or pq nodes which inject ...

متن کامل

On Traffic Load Distribution and Load Balancing in Dense Wireless Multihop Networks

We study the load balancing problem in a dense wireless multihop network, where a typical path consists of a large number of hops, that is, the spatial scales of a typical distance between source and destination and mean distance between the neighboring nodes are strongly separated. In this limit, we present a general framework for analyzing the traffic load resulting from a given set of paths ...

متن کامل

Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs

This paper reports design and preliminary evaluation of an integrated load distribution-load balancing algorithm which was targeted to be both efficient and scalable for dynamically structured computations. The computation is represented as a dynamic hierarchical dependence graph. Each node of the graph may be a subgraph or a computation and the number of instances of each node is dynamically d...

متن کامل

Threshold Load Balancing in Networks

We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m ≫ n users that try to find an acceptable resource by moving along the edges of the graph. Users accept a resource if the load is below a threshold. Such thresholds have an intuitive meaning, e.g., as deadlines in a machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Systems & Control Letters

سال: 2013

ISSN: 0167-6911

DOI: 10.1016/j.sysconle.2013.08.001